Spanning tree - PDFSEARCH.IO - Document Search Engine

Spanning tree
Results: 445

#	Item
31	Drawing Power Law Graphs using a Local/Global Decomposition ∗ Reid Andersen Fan Chung Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2005-02-25 13:23:11 Graph theory Matching Combinatorial optimization Graph coloring Spanning tree NP-complete problems Ear decomposition K-edge-connected graph Line graph
32	A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-04-27 05:26:50 Computational complexity theory Graph theory Mathematics NP-complete problems Steiner tree problem Approximation algorithm APX Spanning tree Optimization problem Wiener connector Travelling salesman problem
33	Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Search algorithms Graph theory Data structures Information science Information retrieval Disjoint-set data structure Binary trees Minimum spanning tree Routing algorithms Link/cut tree HeldKarp algorithm
34	CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-01 15:15:38 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Operations research Combinatorial optimization NP-hard problems Online algorithm Steiner tree problem Minimum spanning tree Travelling salesman problem
35	Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-11-30 21:17:11 Spanning tree NP-complete problems Routing algorithms Edsger W. Dijkstra Combinatorial optimization Steiner tree problem Minimum spanning tree Shortest path problem Eulerian path Algorithm Randomized algorithm Matching
36	Part Number: KEY FEATURES AND BENEFITS:: • Eight 10/100BASE-TX ports Add to Reading List Source URL: www.econolite.com Language: English - Date: 2016-05-13 17:33:37 Network protocols Ethernet Network architecture Local area networks Computer networking Network switch Virtual LAN Spanning Tree Protocol IEEE 802.1Q Modbus Private VLAN Link aggregation
37	Lower Bounds for  Local Algorithms Jukka Suomela Aalto University, Finland ! Add to Reading List Source URL: users.ics.aalto.fi Language: English - Date: 2014-10-12 20:39:47 Graph theory Graph Distributed computing Distributed minimum spanning tree
38	Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:11 Network theory NP-complete problems Edsger W. Dijkstra Graph coloring Spanning tree Matching Shortest path problem Logical matrix Treewidth Matrix Minimum spanning tree Clique
39	Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg Add to Reading List Source URL: ad-publications.informatik.uni-freiburg.de Language: English - Date: 2013-04-29 10:40:39 NP-complete problems Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Dominating set A* search algorithm Optimization problem Minimum spanning tree Shortest path problem Treewidth Flow network
40	CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-04 19:18:44 NP-complete problems Edsger W. Dijkstra Spanning tree Matroid theory Operations research Online algorithm Steiner tree problem Matroid Shortest path problem Algorithm Travelling salesman problem Greedy algorithm